Bounded Disagreement

A well-known generalization of the consensus problem, namely, set agreement (SA), limits the number of distinct decision values that processes decide. In some settings, it may be more important to limit the number of “disagreers”. Thus, we introduce another natural generalization of the consensus problem, namely, bounded disagreement (BD), which limits the number of processes that decide differently from the plurality. More precisely, in a system with n processes, the (n, `)-BD task has the following requirement: there is a value v such that at most ` processes (the disagreers) decide a value other than v. Despite their apparent similarities, the results described below show that bounded disagreement, consensus, and set agreement are in fact fundamentally different problems. We investigate the relationship between bounded disagreement, consensus, and set agreement. In particular, we determine the consensus number [16] for every instance of the BD task. We also determine values of n, `, m, and k such that the (n, `)-BD task can solve the (m, k)-SA task (where m processes can decide at most k distinct values). Using our results and a previouslyknown impossibility result for set agreement [8], we prove that for all n ≥ 2, there is a BD task (and a corresponding BD object) that has consensus number n but can not be solved using n-consensus and registers. Prior to our paper, the only objects known to have this unusual characteristic for n ≥ 2 (which shows that the consensus number of an object is not sufficient to fully capture its power) were artificial objects crafted solely for the purpose of exhibiting this behaviour [2, 18]. 1998 ACM Subject Classification C.2.4 Distributed Systems